Adequacy for a lazy functional language with recursive and polymorphic types
نویسندگان
چکیده
منابع مشابه
Miranda: A Non-Strict Functional language with Polymorphic Types
data types Many of the data types which in other languages would have to be expressed as abstract data types can be represented in Miranda as algebraic data types with associated laws. Nevertheless there is still a need for abstract data types, as may be seen from the following example (which is based on a use of abstract data types in the LCF system [Gordon et al 79]).
متن کاملA General Framework for Lazy Functional Logic, Programming with Algebraic Polymorphic Types
We propose a general framework for first-order functional logic programming, supporting lazy functions, non-determinism and polymorphic datatypes whose data constructors obey a set C of equational axioms. On top of a given C, we specify a program as a set R of Cbased conditional rewriting rules for defined functions. We argue that equational logic does not supply the proper semantics for such p...
متن کاملFaithful Ideal Models for Recursive Polymorphic Types
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yields a close t between models and programming language. Two of our semantics of type expressions are faithful, in the sense that programs that behave identically in all contexts have exactly the same types.
متن کاملUsing a Lazy Functional Language for TextualInformation
This paper describes a new implementation technique for index-assisted searching in a textual database: the use of a lazy functional programming language to describe high-level search strategies , combined with low-level implementation languages (such as C) for primitive index and text access. Our implementation, in the concrete context of the ARTFL database, demonstrates the feasibility of thi...
متن کاملSyntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in the study of typed languages, for example to establish contextual equivalences of terms. The chief difficulty in using logical relations is to establish the existence of a suitable relational interpretation. We extend w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00129-7